-
1 least-squares scheme
Макаров: метод наименьших квадратов -
2 method of least squares
мат., стат. метод наименьших квадратов (метод определения параметров генеральной совокупности путем минимизации критериев суммы квадратов отклонений между фактическими и расчетными данными; предложен К. Гауссом (1794-95) и А. Лежандром (1805-06); представляет собой один из важнейших разделов математической статистики и широко используется для статистических выводов в различных областях науки и техники; в управленческом учете используется для разбиения смешанных затрат на постоянную и переменную составляющие — посредством статистических приемов строится линия регрессии, представляющая совокупные смешанные затраты)Syn:least square method, least squares method, least-squares method, least-squares technique, LS, LS method, least square procedure, least square technique, least-squares scheme, least square, principle of least squares, least squares, technique of least squares, least squares technique, least-squares procedure, method of least-squares, least-squares analysisSee:Англо-русский экономический словарь > method of least squares
См. также в других словарях:
Linear least squares (mathematics) — This article is about the mathematics that underlie curve fitting using linear least squares. For statistical regression analysis using least squares, see linear regression. For linear regression on a single variable, see simple linear regression … Wikipedia
Linear least squares — is an important computational problem, that arises primarily in applications when it is desired to fit a linear mathematical model to measurements obtained from experiments. The goals of linear least squares are to extract predictions from the… … Wikipedia
Linear least squares/Proposed — Linear least squares is an important computational problem, that arises primarily in applications when it is desired to fit a linear mathematical model to observations obtained from experiments. Mathematically, it can be stated as the problem of… … Wikipedia
Marching squares — is a computer graphics algorithm that generates contours for a two dimensional scalar field (rectangular array of individual numerical values). A similar method can be used to contour 2D triangle meshes. The contours can be of two kinds: Isolines … Wikipedia
mathematics — /math euh mat iks/, n. 1. (used with a sing. v.) the systematic treatment of magnitude, relationships between figures and forms, and relations between quantities expressed symbolically. 2. (used with a sing. or pl. v.) mathematical procedures,… … Universalium
List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra … Wikipedia
Scale-invariant feature transform — Feature detection Output of a typical corner detection algorithm … Wikipedia
Dynamic programming — For the programming paradigm, see Dynamic programming language. In mathematics and computer science, dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems… … Wikipedia
List of algorithms — The following is a list of the algorithms described in Wikipedia. See also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures.If you intend to describe a new algorithm,… … Wikipedia
John von Neumann — Von Neumann redirects here. For other uses, see Von Neumann (disambiguation). The native form of this personal name is Neumann János. This article uses the Western name order. John von Neumann … Wikipedia
List of mathematics articles (L) — NOTOC L L (complexity) L BFGS L² cohomology L function L game L notation L system L theory L Analyse des Infiniment Petits pour l Intelligence des Lignes Courbes L Hôpital s rule L(R) La Géométrie Labeled graph Labelled enumeration theorem Lack… … Wikipedia
